A New Transitive Closure Algorithm with Application to Redundancy Identi cation

A new transitive closur ealgorithm is presented for implication graphs that c ontainpartial implications. In the presence of partial implications, a vertex can assume the true state when all vertices that p artially imply it become true. Such graphs provide a more complete representation of a logic cir cuit than is possible with the conventional pair-wise implications. A napplic ation of the new transitive closur e algorithm to redundancy identi cation shows signi cantly improved results. Empiric ally, we nd the computational complexity of transitive closure to be linear for the implication graphs of the ISCAS benchmark circuits.